Latin k-hypercubes

نویسندگان

  • Steven T. Dougherty
  • Theresa A. Szczepanski
چکیده

We study k dimensional Latin hypercubes of order n. We describe the automorphism groups of the hypercubes and define the parity of a hypercube and relate the parity with the determinant of a permutation hypercube. We determine the parity in the orbits of the automorphism group. Based on this definition of parity we make a conjecture similar to the Alon-Tarsi conjecture. We define an orthogonality relation between hypercubes and we show that a set of mutually orthogonal Latin k dimensional hypercubes correspond to MDS codes and to k+1 dimensional permutation hypercubes satisfying a combinatorial condition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A General Construction for Space-filling Latin Hypercubes

Abstract: We propose a general method for constructing Latin hypercubes of flexible run sizes for computer experiments. The method makes use of arrays with a special structure and Latin hypercubes. By using different such arrays and Latin hypercubes, the proposed method produces various types of Latin hypercubes including orthogonal and nearly orthogonal Latin hypercubes, sliced Latin hypercube...

متن کامل

Maximal Partial Latin Cubes

We prove that each maximal partial Latin cube must have more than 29.289% of its cells filled and show by construction that this is a nearly tight bound. We also prove upper and lower bounds on the number of cells containing a fixed symbol in maximal partial Latin cubes and hypercubes, and we use these bounds to determine for small orders n the numbers k for which there exists a maximal partial...

متن کامل

On the Structure of Orthogonal Latin Hypercubes

The structure of orthogonal Latin hypercubes(OLH) is established in vector space over GF(2). An upper bound on the number of columns of an OLH is given. An OLH whose number of columns reaches the upper bound are found for m = 3 and m = 4, while the cases for m 5 are still unknown.

متن کامل

Efficient Nearly Orthogonal and Space-Filling Latin Hypercubes

This article presents an algorithm for constructing orthogonal Latin hypercubes, given a fixed sample size, in more dimensions than previous approaches. In addition, we detail a method that dramatically improves the space-filling properties of the resultant Latin hypercubes at the expense of inducing small correlations between the columns in the design matrix. Although the designs are applicabl...

متن کامل

Construction of Orthogonal Nearly Latin Hypercubes

Orthogonal Latin hypercubes (OLHs) are available for only a limited collection of run sizes. This paper presents a simple algorithm for constructing orthogonal designs that are nearly Latin hypercubes. The algorithm is based on the approach developed by Steinberg and Lin for OLH designs and can generate designs for all run sizes for which a Plackett-Burman design exists. The designs have good u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2008